Necessary and Sufficient Condition for a Class of Reachability in Petri Nets
نویسندگان
چکیده
منابع مشابه
Compositional Reachability in Petri Nets
We introduce a divide-and-conquer algorithm for a modified version of the reachability/coverability problem in 1-bounded Petri nets that relies on the compositional algebra of nets with boundaries: we consider the algebraic decomposition of the net of interest as part of the input. We formally prove the correctness of the technique and contrast the performance of our implementation with state-o...
متن کاملA Necessary and Sufficient Condition for Transcendency
As has been known for many years (see, e.g., K. Mahler, /. Reine Angew. Math., v. 166, 1932, pp. 118-150), a real or complex number f is transcendental if and only if the following condition is satisfied. To every positive number co there exists a positive integer n and an infinite sequence of distinct polynomials {p,(z)} = {pr + pr z + • • • + p z } at most of 0 1 n degree n with integral coef...
متن کاملA Necessary and Sufficient Condition for Peace∗
This paper examines the possibility for two contestants to agree on a peace settlement thereby avoiding a contest, in which each would exert a costly effort given the posterior distributions inferred from the negotiation. I find a necessary and sufficient condition of the prior distributions for there to exist a negotiation mechanism that admits a peace-ensuring perfect Bayesian equilibrium. Th...
متن کاملParameterized Reachability Trees for Algebraic Petri Nets
This paper is concerned with parameterized reachability trees, which have been proposed by M. Lindquist for predicate/transition nets. We discuss the application of this concept to algebraic nets. For this purpose a slight modification of several definitions is necessary due to the different net descriptions, transition rules and theoretical backgrounds. That’s why we present the whole concept ...
متن کاملHierarchical Reachability Graph Generation for Petri Nets
Reachability analysis is the most general approach to the analysis of Petri nets. Due to the wellknown problem of state-space explosion, generation of the reachability set and reachability graph with the known approaches often becomes intractable even for moderately sized nets. This paper presents a new method to generate and represent the reachability set and reachability graph of large Petri ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 1984
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.20.762